Convex programming for disjunctive convex optimization

Given a nite number of closed convex sets whose algebraic representation is known, we study the problem of optimizing a convex function over the closure of the convex hull of the union of these sets. We derive an algebraic characterization of the feasible region in a higher-dimensional space and propose a solution procedure akin to the interior-point approach for convex programming.